Significant edges in the case of non-stationary Gaussian noise
نویسندگان
چکیده
In this paper, we propose an edge detection technique based on some local smoothing of the image followed by a statistical hypothesis testing on the gradient. An edge point being defined as a zero-crossing of the Laplacian, it is said to be a significant edge point if the gradient at this point is larger than a threshold s(ε) defined by: if the image I is pure noise, then the probability of ‖∇I(x)‖ ≥ s(ε) conditionally on ∆I(x) = 0 is less than ε. In other words, a significant edge is an edge which has a very low probability to be there because of noise. We will show that the threshold s(ε) can be explicitly computed in the case of a stationary Gaussian noise. In the images we are interested in, which are obtained by tomographic reconstruction from a radiograph, this method fails since the Gaussian noise is not stationary anymore. Nevertheless, we are still able to give the law of the gradient conditionally on the zero-crossing of the Laplacian, and thus compute the threshold s(ε). We will end this paper with some experiments and compare the results with those obtained with other edge detection methods.
منابع مشابه
Noisy images edge detection: Ant colony optimization algorithm
The edges of an image define the image boundary. When the image is noisy, it does not become easy to identify the edges. Therefore, a method requests to be developed that can identify edges clearly in a noisy image. Many methods have been proposed earlier using filters, transforms and wavelets with Ant colony optimization (ACO) that detect edges. We here used ACO for edge detection of noisy ima...
متن کاملSignificant edges in the case of a non-stationary Gaussian noise
In this paper, we propose an edge detection technique based on some local smoothing of the image followed by a statistical hypothesis testing on the gradient. An edge point being defined as a zero-crossing of the Laplacian, it is said to be a significant edge point if the gradient at this point is larger than a threshold s(ε) defined by: if the image I is pure noise, then P(‖∇I‖ ≥ s(ε) ∣ ∣ ∆I =...
متن کاملShearlet-Based Adaptive Noise Reduction in CT Images
The noise in reconstructed slices of X-ray Computed Tomography (CT) is of unknown distribution, non-stationary, oriented and difficult to distinguish from main structural information. This requires the development of special post-processing methods based on the local statistical evaluation of the noise component. This paper presents an adaptive method of reducing noise in CT images employing th...
متن کاملSpeech enhancement based on hidden Markov model using sparse code shrinkage
This paper presents a new hidden Markov model-based (HMM-based) speech enhancement framework based on the independent component analysis (ICA). We propose analytical procedures for training clean speech and noise models by the Baum re-estimation algorithm and present a Maximum a posterior (MAP) estimator based on Laplace-Gaussian (for clean speech and noise respectively) combination in the HMM ...
متن کاملThe Rate of Entropy for Gaussian Processes
In this paper, we show that in order to obtain the Tsallis entropy rate for stochastic processes, we can use the limit of conditional entropy, as it was done for the case of Shannon and Renyi entropy rates. Using that we can obtain Tsallis entropy rate for stationary Gaussian processes. Finally, we derive the relation between Renyi, Shannon and Tsallis entropy rates for stationary Gaussian proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition
دوره 40 شماره
صفحات -
تاریخ انتشار 2007